Cayley tree

См. также в других словарях:

• Cayley graph — In mathematics, the Cayley graph, also known as the Cayley colour graph, is the graph that encodes the structure of a discrete group. Its definition is suggested by Cayley s theorem (named after Arthur Cayley) and uses a particular, usually… …   Wikipedia

• Cayley's formula — 2^{2 2}=1 tree with 2 vertices,3^{3 2}=3 trees with 3 vertices and 4^{4 2}=16trees with 4 vertices.In mathematics, Cayley s formula is a result in graph theory named after Arthur Cayley. It states that if n is an integer bigger than 1, the number …   Wikipedia

• Tree structure — A tree structure showing the possible hierarchical organization of an encyclopedia …   Wikipedia

• Tree (graph theory) — Trees A labeled tree with 6 vertices and 5 edges Vertices v Edges v 1 Chromatic number …   Wikipedia

• Spanning tree (mathematics) — In the mathematical field of graph theory, a spanning tree T of a connected, undirected graph G is a tree composed of all the vertices and some (or perhaps all) of the edges of G . Informally, a spanning tree of G is a selection of edges of G… …   Wikipedia

• Arthur Cayley — Infobox Scientist name = Arthur Cayley |242px image width = 242px caption = Portrait in London by Barraud Jerrard birth date = birth date|1821|8|16|mf=y birth place = Richmond, Surrey, UK residence = England nationality = British death date =… …   Wikipedia

• Fórmula de Cayley — Lista completa de todos los árboles con 2,3 y 4 vértices etiquetados: 22 − 2 = 1 árboles con 2 vértices, 33 − 2 = 3 árboles con 3 vértices y 44 − 2 = 16 árboles con 4 vértices. En teoría de grafos, la fórmula de Cayley es un resultado lla …   Wikipedia Español

• Coppola family tree —           …   Wikipedia

• Bethe lattice — A Bethe lattice or Cayley tree, introduced by Hans Bethe in 1935, is a connected cycle free graph where each node is connected to z neighbours, where z is called the coordination number. It can be seen as a tree like structure emanating from a… …   Wikipedia

• Iterated function system — In mathematics, iterated function systems or IFSs are a method of constructing fractals; the resulting constructions are always self similar.IFS fractals as they are normally called can be of any number of dimensions, but are commonly computed… …   Wikipedia

• Hutchinson operator — In mathematics, in the study of fractals, a Hutchinson operator is a collection of functions on an underlying space E . The iteration on these functions gives rise to an iterated function system, for which the fixed set is self… …   Wikipedia